Concurrent Systems: Hybrid Object Implementations and Abortable Objects
نویسنده
چکیده
c M. Raynal, Concurrent objects: entering a modern era 2 The world is changing • Concurrency in multiprocessors is true concurrency • It follows that the concurrency concepts and techniques used to cope with multiplexing or interrupt handling are no longer appropriate, and must be revisited to address the current computing world • " Changes in technology can have far-reaching effects on theory.[...] After decades of being respected but not taken seriously, research on multiprocessor algorithms and data structures is going mainstream " The world is changing (cont'd) • Before the introduction of multicore processors, paral-lelism was largely dedicated to computational problems with regular, slow-changing (or even static) communication and coordination patterns. Such problems arise in scientific computing or in graphics, but rarely in systems. The future promises us multiple cores on anything from phones to laptops, desktops, and servers, and therefore a plethora of applications characterized by complex, fast-changing ineractions and data exchanges. "
منابع مشابه
Solo-Fast Universal Constructions for Deterministic Abortable Objects
In this paper we study efficient implementations for deterministic abortable objects. Proposed by Hadzilacos and Toueg [8] a deterministic abortable object ensures that if several processes contend to operate on it, it may return a special response abort to indicate that the operation failed. And it guarantees that an aborted operation does not take effect. Operations that do not abort return a...
متن کاملLooking for Efficient Implementations of Concurrent Objects
As introduced by Taubenfeld, a contention-sensitive implementation of a concurrent object is an implementation such that the overhead introduced by locking is eliminated in the common cases, i.e., when there is no contention or when the operations accessing concurrently the object are non-interfering. This paper, that can be considered as an introductory paper to this topic, presents a methodol...
متن کاملStrict Linearizability and the Power of Aborting
Linearizability is a popular way to define the concurrent behavior of shared objects. However, linearizability allows operations that crash to take effect at any time in the future. This can be disruptive to systems where crashes are externally visible. In such systems, an operation that crashes should either not happen or happen within some limited time frame—preferably before the process cras...
متن کاملk-Abortable Objects: Progress Under High Contention
In this paper, we define k-abortable objects, the first kind of abortable objects [2,7] that guarantee some degree of progress even under high contention. The definition is simple and natural: intuitively, an operation on a k-abortable object can abort only if k operations from distinct processes succeed during the execution of the aborted operation. We first show that k-abortable objects can e...
متن کاملDistributed Quantum Computing
In conjunction with DISC 2013, the TransForm project (Marie Curie Initial Training Network) and EuroTM (COST Action IC1001) supported the 5th edition of the Workshop on the Theory of Transactional Memory (WTTM 2013). The objective of WTTM was to discuss new theoretical challenges and recent achievements in the area of transactional computing with emphasis on transactional memory. The workshop t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015